Generalizing State Machine Replication (Preliminary Version)
نویسنده
چکیده
We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This generalizes the celebrated universality of consensus which enables to build a state machine that always progresses. Besides some interesting extensions and even potential “practical” applications, theoretically, a fundamental ramification of our main result, derived by considering the state machines to be interacting read-write threads, is a flagpole to the thesis that distributed computing is all about wait-freedom. We indeed show that the set of tasks that are read-write solvable “k-concurrently” , i.e., when concurrency goes below k, is the same set of tasks that are read-write solvable with k-set consensus.
منابع مشابه
Programming by demonstration using version space algebra DRAFT to appear in Machine Learning
Programming by demonstration enables users to easily personalize their applications, automating repetitive tasks simply by executing a few examples. We formalize programming by demonstration as a machine learning problem: given the changes in the application state that result from the user’s demonstrated actions, learn the general program that maps from one application state to the next. We pre...
متن کاملAll about Eve : Execute - Verify Replication for Multi - Core Servers ( extended version )
This paper presents Eve, a new Execute-Verify architecture that allows state machine replication to scale to multi-core servers. Eve departs from the traditional agree-execute architecture of state machine replication: replicas first execute groups of requests concurrently and then verify that they can reach agreement on a state and output produced by a correct replica; if they can not, they ro...
متن کاملStatic Analysis Meets Distributed Fault-Tolerance: Enabling State-Machine Replication with Nondeterminism
Midas is an inter-disciplinary approach to supporting state-machine replication for nondeterministic distributed applications. The approach exploits compile-time static analysis to identify both first-hand and second-hand sources of nondeterminism. Subsequent runtime compensation occurs through either the transfer of nondeterministic checkpoints or the reexecution of inserted code, and restores...
متن کاملHT-Paxos: High Throughput State-Machine Replication Protocol for Large Clustered Data Centers
Paxos is a prominent theory of state-machine replication. Recent data intensive systems that implement state-machine replication generally require high throughput. Earlier versions of Paxos as few of them are classical Paxos, fast Paxos, and generalized Paxos have a major focus on fault tolerance and latency but lacking in terms of throughput and scalability. A major reason for this is the heav...
متن کاملreplikativ.io: Composable consistency primitives for a scalable and robust global replication system
The following work introduces a replication system build around CRDTs with a new convergent replicated datatype for a distributed version control system. It retains the order of write operations at the tradeoff of reduced availability with after-the-fact conflict resolution. The combined system allows to develop applications with distributed state in a similar fashion to native applications wit...
متن کامل